A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs

نویسندگان

  • Douglas R. Stinson
  • Colleen Swanson
  • Tran van Trung
چکیده

In 1963, Shrikhande and Raghavarao [5] published a recursive construction for designs that starts with a resolvable design (the “master design”) and then uses a second design (“the indexing design”) to take certain unions of blocks in each parallel class of the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrating on the case where the master design is a resolvable BIBD and the indexing design is a 3-design. We show that this construction yields a 3-design under certain circumstances. The resulting 3-designs have block size k = v/2 and they are resolvable. We also construct some previously unknown simple designs by this method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of resolvable H-designs with group sizes 2, 3, 4 and 6

In 1987, Hartman showed that the necessary condition v ≡ 4 or 8 (mod 12) for the existence of a resolvable SQS(v) is also sufficient for all values of v, with 23 possible exceptions. These last 23 undecided orders were removed by Ji and Zhu in 2005 by introducing the concept of resolvable H-designs. In this paper, we first develop a simple but powerful construction for resolvable H-designs, i.e...

متن کامل

Constructing some PBIBD(2)s by Tabu Search Algorithm

Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able ...

متن کامل

Some Block Designs Constructed from Resolvable Designs

LetD be a resolvable 2−(v, k, λ) design, andD′ be a 2−(v′, k′, λ′) design, such that v′ = v k . Further, let r and r′ be replication numbers of a point in D and D′, respectively. Shrikhande and Raghavarao proved that then there exists a 2 − (v′′, k′′, λ′′) design D′′, such that v′′ = v, k′′ = kk′ and λ′′ = r′λ + (r − λ)λ′. If D′ is resolvable, then D′′ is also resolvable. Applying this result, ...

متن کامل

Graphs with the N-e.c. Adjacency Property Constructed from Resolvable Designs

Random graphs with high probability satisfy the n-e.c. adjacency property, although until recently few explicit examples of such graphs were known. We supply a new general construction for generating infinite familes of finite regular n-e.c. graphs derived from certain resolvable Steiner 2-designs. We supply an extension of our construction to the infinite case, and thereby give a new represent...

متن کامل

Optimal resolvable designs with minimum PV aberration

Amongst resolvable incomplete block designs, affine resolvable designs are optimal in many conventional senses. However, different affine resolvable designs for the same numbers of treatments, replicates, and block size can differ in how well they estimate elementary treatment contrasts. An aberration criterion is employed to distinguish the best of the affine resolvable designs for this task. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 325  شماره 

صفحات  -

تاریخ انتشار 2014